Step of Proof: comb_for_absval_wf
12,41
postcript
pdf
Inference at
*
I
of proof for Lemma
comb
for
absval
wf
:
(
x
,
z
. |
x
|)
(
True)
latex
by (ProveOpCombinatorTyping (Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
)) (first_tok :t) inil_term)) `absval_wf`
latex
.
Definitions
t
T
,
,
x
:
A
.
B
(
x
)
,
T
Lemmas
true
wf
,
squash
wf
,
absval
wf
origin